Restarting Tree Automata

Restarting Automata with Structured Output and Functional Generative Description

Restarting automata were introduced for modeling linguistically motivated analysis by reduction. In this paper we enhance these automata with a structured output in the form of a tree. Enhanced restarting automata can serve as a formal framework for the Functional Generative Description. In this framework, a natural language is described at four layers. Working simultaneously with all these lay...

(In)Dependencies in Functional Generative Description by Restarting Automata

We provide a formal model of a stratificational dependency approach to natural language description. This formal model is motivated by an elementary method of analysis by reduction, which serves for describing correct sentence analysis. The model is based on enhanced restarting automata that assign a set of parallel dependency structures to every reduction of an input sentence. These structures...

Towards a formal model of natural language description based on restarting automata with parallel DR-structures

We provide a formal model of a stratificational dependency approach to natural language description. This formal model is motivated by an elementary method of analysis by reduction, which serves for describing correct sentence analysis. The model is based on enhanced restarting automata that assign a set of parallel dependency structures to every reduction of an input sentence. These structures...

Restarting Tree Automata and Linear Context-Free Tree Languages

Lower Bounds for Nonforgetting Restarting Automata and CD-Systems of Restarting Automata

Some lower bound results are presented that separate the language classes accepted by certain types of nonforgetting restarting automata or CD-systems of restarting automata from each other.